On discounted dynamic programming with unbounded returns
نویسندگان
چکیده
منابع مشابه
Constrained Discounted Dynamic Programming
This paper deals with constrained optimization of Markov Decision Processes with a countable state space, compact action sets, continuous transition probabilities, and upper semi-continuous reward functions. The objective is to maximize the expected total discounted reward for one reward function, under several inequality constraints on similar criteria with other reward functions. Suppose a fe...
متن کاملSmooth Value and Policy Functions for Discounted Dynamic Programming
We consider a discounted dynamic program in which the spaces of states and actions are smooth (in a sense that is suitable for the problem at hand) manifolds. We give conditions that insure that the optimal policy and the value function are smooth functions of the state when the discount factor is small. In addition, these functions vary in a Lipschitz manner as the reward function-discount fac...
متن کاملDynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem
We propose a new hybrid approach to solve the unbounded integer knapsack problem (UKP), where valid inequalities are generated based on intermediate solutions of an equivalent forward dynamic programming formulation. These inequalities help tighten the initial LP relaxation of the UKP, and therefore improve the overall computational efficiency. We also extended this approach to solve the multi-...
متن کاملEecient Dynamic Programming for the Unbounded Knapsack Problem
We present an eecient implementation of the dynamic programming algorithm for the unbounded knapsack problem, a classic NP-hard combinatorial optimization problem. We use four important techniques to obtain the improvements: (i) the notion of maximal dominance between the object types; the ideas of (ii) periodicity; and (iii) sparsity; and (iv) the design of a new hybrid recurrence equation tha...
متن کاملRecursive utility and optimal growth with bounded or unbounded returns
In this paper we propose a unifying approach to the study of recursive economic problems. Postulating an aggregator function as the fundamental expression of tastes, we explore conditions under which a utility function can be constructed. We also modify the usual dynamic programming arguments to include this class of models. We show that Bellman’s equation still holds, so many results known for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economic Theory
سال: 2010
ISSN: 0938-2259,1432-0479
DOI: 10.1007/s00199-010-0522-5